Genetic Algorithms for Changing Environments
نویسنده
چکیده
Genetic algorithms perform an adaptive search by maintaining a population of candidate solutions that are allocated dynamically to promising regions of the search space. The distributed nature of the genetic search provides a natural source of power for searching in changing environments. As long as sufficient diversity remains in the population the genetic algorithm can respond to a changing response surface by reallocating future trials. However, the tendency of genetic algorithms to converge rapidly reduces their ability to identify regions of the search space that might suddenly become more attractive as the environment changes. This paper presents a modification of the standard generational genetic algorithm that is designed to maintain the diversity required to track a changing response surface. An experimental study shows some promise for the new technique.
منابع مشابه
Chaotic Genetic Algorithm based on Explicit Memory with a new Strategy for Updating and Retrieval of Memory in Dynamic Environments
Many of the problems considered in optimization and learning assume that solutions exist in a dynamic. Hence, algorithms are required that dynamically adapt with the problem’s conditions and search new conditions. Mostly, utilization of information from the past allows to quickly adapting changes after. This is the idea underlining the use of memory in this field, what involves key design issue...
متن کاملSystematic, Controlled Observations of the Genetic Algorithm in a Regularly Changing Environment: Case Studies Using the Shaky Ladder Hyperplane Defined Functions
Systematic, Controlled Observations of the Genetic Algorithm in a RegularlyChanging Environment: Case Studies Using the Shaky Ladder Hyperplane DefinedFunctions byWilliam M. Rand Co-Chairs: John H. Holland and Rick L. Riolo Though recently there has been interest in examining genetic algorithms (GAs) indynamic environments, work still needs to be done in investigating the fundam...
متن کاملGenetic Algorithms with Elitism-Based Immigrants for Changing Optimization Problems
Addressing dynamic optimization problems has been a challenging task for the genetic algorithm community. Over the years, several approaches have been developed into genetic algorithms to enhance their performance in dynamic environments. One major approach is to maintain the diversity of the population, e.g., via random immigrants. This paper proposes an elitism-based immigrants scheme for gen...
متن کاملNovel Hybrid Fuzzy-Evolutionary Algorithms for Optimization of a Fuzzy Expert System Applied to Dust Phenomenon Forecasting Problem
Nowadays, dust phenomenon is one of the important challenges in warm and dry areas. Forecasting the phenomenon before its occurrence helps to take precautionary steps to prevent its consequences. Fuzzy expert systems capabilities have been taken into account to assist and cope with the uncertainty associated to complex environments such as dust forecasting problem. This paper presents novel hyb...
متن کاملComparison of Steady State and Generational Genetic Algorithms for Use in Nonstationary Environments
The objective of this study is a comparison of two models of the genetic algorithm, the generational and incremental/steady state genetic algorithms, for use in nonstationary/dynamic environments. It is experimentally shown that choice of a suitable version of the genetic algorithm can improve its performance in such environments. This can extend ability of the genetic algorithm to track enviro...
متن کامل